Effective Bandwidth Problem Revisited

The paper studies a single-server queueing system with autonomous service and l priority classes. Arrival and departure processes are defined by marked point processes. There are l buffers corresponding to priority classes, and upon arrival a unit of the kth priority class occupies the place in the kth buffer. Let N , k = 1, 2, . . . , l denote the quota for the total kth buffer content. The values N (k) are assumed to be large, and queueing systems both with finite and infinite buffers are studied. In the case of system with finite buffers, the values N (k) characterize buffer capacities. The paper discusses a circle of problems related to optimization of performance measures associated with overflowing the quota of buffer contents. Our approach to this problem is new, and presentation of our results is simple and clear for real applications.